Performance Analysis of a Special GPIU Method for Singular Saddle Point Problems
نویسنده
چکیده
In this paper, we first provide semi-convergence analysis for a special GPIU(Generalized Parameterized Inexact Uzawa) method with singular preconditioners for solving singular saddle point problems. We next provide a methodology of how to choose nearly quasi-optimal parameters of the special GPIU method. Lastly, numerical experiments are carried out to examine the effectiveness of the special GPIU method with singular preconditioners by comparing its performance with that of other existing iterative methods for solving singular saddle point problems.
منابع مشابه
A note on GPIU method for generalized saddle point problems
In this note, the generalized parameterized inexact Uzawa method, abbreviated as the GPIU method, for solving the generalized saddle point problems with symmetric positive semi-definite (2,2) block is studied. The convergence of the method is established, which is an extension of the results obtained in a recent paper by Zhou and Zhang (2009) [22]. Crown Copyright 2013 Published by Elsevier Inc...
متن کاملPerformance Comparison of Relaxation Methods with Singular and Nonsingular Preconditioners for Singular Saddle Point Problems
In this paper, we first review the PU and Uzawa-SAOR relaxation methods with singular or nonsingular preconditioning matrices for solving singular saddle point problems, and then we provide numerical experiments to compare performance results of the relaxation iterative methods using nonsingular preconditioners with those using singular preconditioners. Mathematics Subject Classification: 65F10...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملAcceleration of One-parameter Relaxation Methods for Singular Saddle Point Problems
In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR m...
متن کاملSemi-convergence Analysis of the Inexact Uzawa Method for Singular Saddle Point Problems
Recently, various Uzawa methods were proposed based on different matrix splitting for solving nonsingular saddle point problems, and the necessary and sufficient condition of the convergence for those Uzawa methods were derived. Motivated by their results, in this paper we give the semi-convergence analysis of the inexact Uzawa method which is applied to solve singular saddle point problems und...
متن کامل